منابع مشابه
Errors in pointing are due to approximations in sensorimotor transformations.
1. We define an extrinsic frame of reference to represent the location of a point in extrapersonal space relative to a human subject's shoulder, and we define an intrinsic frame of reference to represent the orientation of the arm and forearm. 2. We examined the relations between coordinates in the extrinsic and intrinsic frames of reference under two experimental conditions: when subjects made...
متن کاملMaximum-entropy and Padé-like approximations to atomic scattering factors
Three different methods, namely maximum entropy, combination of Dirac deltas and two-point Padé approximants, are used to construct tight model-independent approximations to the atomic form factor F(k) in terms of a few quantities related to its inverse Fourier trnsform, i.e. the one-particle density ρ(r). The accuracy of these approximations is analyzed in a Hartree-Fock framework. These extra...
متن کاملApproximations for the Maximum Acyclic Subgraph Problem
Given a directed graph G V A the maximum acyclic subgraph problem is to compute a subset A of arcs of maximum size or total weight so that G V A is acyclic We discuss several approximation algorithms for this problem Our main result is an O jAj d max algorithm that produces a solution with at least a fraction p dmax of the number of arcs in an optimal solution Here dmax is the maximum vertex de...
متن کاملO(1)-Approximations for Maximum Movement Problems
We develop constant-factor approximation algorithms for minimizing the maximum movement made by pebbles on a graph to reach a configuration in which the pebbles form a connected subgraph (connectivity), or interconnect a constant number of stationary nodes (Steiner tree). These problems model the minimization of the total time required to reconfigure a robot swarm to achieve a proximity (e.g., ...
متن کاملImproved Approximations of Maximum Planar Subgraph
The maximum planar subgraph problem (MPSP) asks for a planar subgraph of a given graph with the maximum total cost. We suggest a new approximation algorithm for the weighted MPSP. We show that it has performance ratio of 5/12 in the case of graphs where the maxumum cost of an edge is at most twice the minimum cost of an edge. For the variant of MPSP that asks for an outerplanar graph, the algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Acoustical Society of America
سال: 1959
ISSN: 0001-4966
DOI: 10.1121/1.1930299